Optimal aggregation algorithms for middleware
نویسندگان
چکیده
منابع مشابه
Optimal Plans for Aggregation
We consider the following problem, which arises in the context of distributed Web computations. An aggregator aims to combine specific data from n sources. The aggregator contacts all sources at once. The time for each source to return its data to the aggregator is independent and identically distributed according to a known distribution. The aggregator at some point stops waiting for data and ...
متن کاملSCAMPI - Sensor Configuration and Aggregation Middleware for Multi Platform Interchange
Sowohl für Unternehmen aus zahlreichen Anwendungsbranchen als auch für Privatpersonen hat die Integration von Sensordaten in unterschiedlichste Applikationen in den letzten Jahren enorm an Bedeutung gewonnen. Durch proprietäre System, heterogene Sensoren sowie unflexible Anwendungen wird dieses dynamische Einbinden von Sensorinformationen für Anwendungsentwickler schwierig bis unmöglich. Ziel d...
متن کاملResearch Report Join Algorithms for Online Aggregation Limited Distribution Notice Join Algorithms for Online Aggregation
This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and speciic requests. After outside...
متن کاملOptimal Rates of Aggregation
We study the problem of aggregation of M arbitrary estimators of a regression function with respect to the mean squared risk. Three main types of aggregation are considered: model selection, convex and linear aggregation. We define the notion of optimal rate of aggregation in an abstract context and prove lower bounds valid for any method of aggregation. We then construct procedures that attain...
متن کاملHyper-Sparse Optimal Aggregation
Given a finite set F of functions and a learning sample, the aim of an aggregation procedure is to have a risk as close as possible to risk of the best function in F . Up to now, optimal aggregation procedures are convex combinations of every elements of F . In this paper, we prove that optimal aggregation procedures combining only two functions in F exist. Such algorithms are of particular int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2003
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(03)00026-6